Handling Equality in Logic Programming via Basic Folding

نویسندگان

  • Anatoli Degtyarev
  • Andrei Voronkov
چکیده

We introduce a new approach to handling equality in logic programs. The method is based on the transformation of equational logic programs into logic programs without equality using basic superposition and the basic folding. We prove soundness, completeness and the existence of terminating strategies. The e ciency of the method is demonstrated on examples. An implementation is brie y discussed.2 2Copyright c 1995,1997 Anatoli Degtyarev, Yuri Koval' and Andrei Voronkov. This technical report and other technical reports in this series can be obtained at http://www.csd.uu.se/~thomas/reports.html or at ftp.csd.uu.se in the directory pub/papers/reports. Some reports can be updated, check one of these addresses for the latest version. 1 Section

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

1980 - First Experiments with Rue Automated Deduction

RUE resolution represents a reformulation of binary resolution so that the basic rules of inference (RUE and NRF) incorporate the axioms of equality. An RUE theorem prover has been implemented and experimental results indicate that this method represents a significant advance in the handling of equality in resolution.

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

Non-Commutative EQ-Logics and Their Extensions

We discuss a formal many-valued logic called EQlogic which is based on a recently introduced special class of algebras called EQ-algebras. The latter have three basic binary operations (meet, multiplication, fuzzy equality) and a top element and, in a certain sense, generalize residuated lattices. The goal of EQ-logics is to present a possible direction in the development of mathematical logics...

متن کامل

Type Inference for Programming Languages: A Constraint Logic Programming Approach

In this paper we present an application of Constraint Logic Programming to the design and implementation of type inference algorithms for programming languages. We present implementations in Prolog and Constraint Handling Rules (CHR) of several algorithms which belong to the state of the art of type inference for programming languages: the Damas-Milner type system, the Ohory system for labeled ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996